Covering points by disjoint boxes with outliers
نویسندگان
چکیده
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For a small, fixed number p, we give algorithms that find the solution in the following running times: For squares we have O(n + k log k) time for p = 1, and O(n log n + kp logp k) time for p = 2, 3. For rectangles we get O(n + k) for p = 1 and O(n log n+ k log k) time for p = 2, 3. In all cases, our algorithms use O(n) space.
منابع مشابه
Classifying negative and positive points by optimal box clustering
In this paper we address the problem of classifying positive and negative data with the technique known as box clustering. A box is homogeneous if it contains only positive (negative) points. Box clustering means finding a family of homogeneous boxes jointly containing all and only positive (negative) points. We first consider the problem of finding a family with the minimum number of boxes. Th...
متن کاملFast Stabbing of Boxes in High Dimensions
We present in this paper a simple yet e cient algorithm for stabbing a set S of n axisparallel boxes in d-dimensional space with c(S) points in output-sensitive time O(dn log c(S)) and linear space. Let c∗(S) and b∗(S) be, respectively, the minimum number of points required to stab S and the maximum number of pairwise disjoint boxes of S. We prove that b(S)6c(S)6c(S)6b(S)(1+log2 b ∗(S))d−1. Sin...
متن کاملPiercing Axis-parallel Boxes
Given a finite family F of axis-parallel boxes in R such that F contains no k + 1 pairwise disjoint boxes, and such that for each two intersecting boxes in F a corner of one box is contained in the other box, we prove that F can be pierced by at most ck log log(k) points, where c is a constant depending only on d. We further show that in some special cases the upper bound on the number of pierc...
متن کاملCovering a set of points by two axis-parallel boxes
In this paper we consider the following covering problem. Given a set S of n points in d-dimensional space, d 2, nd two axis-parallel boxes that together cover the set S such that the measure of the largest box is minimized, where the measure is a monotone function of the box. We present a simple algorithm for nding boxes in O(n log n + n d?1) time and O(n) space.
متن کاملOn covering of any point configuration by disjoint unit disks
We give a configuration of 53 points that cannot be covered by disjoint unit disks. This improves the previously known configuration of 55 points.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 44 شماره
صفحات -
تاریخ انتشار 2011